Second-order noiseless source coding theorems
نویسنده
چکیده
I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limit theorem" and a law of the iterated logarithm. Index Terms { Source coding theorems, convergence rates, coding variance.
منابع مشابه
PubTeX output 1997.05.27:1654
Shannon’s celebrated source coding theorem can be viewed as a “one-sided law of large numbers.” We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a “one-sided central limit theorem” and a law of the iterated logarithm.
متن کاملNoiseless Coding Theorems Corresponding to Fuzzy Entropies
Noiseless coding theorems connected with fuzzy entropies corresponding to Shannon, Renyi and Havrada and Charvat have been established. The upper bounds of these entropies in terms of mean code word lengths have been provided and some interesting properties of these codeword lengths have been studied.
متن کاملApplication of Fuzzy Information Measure to Coding Theory
The objective of the present communication is to develop new measure , called average code word length of order and type and establish its relationship with a result of generalized fuzzy information measures. Using , Noiseless coding theorems connected with fuzzy information measure have been proved.
متن کاملSome Noiseless Coding Theorem Connected with Havrda and Charvat and Tsallis’s Entropy
A new measure Lα, called average code word length of order α and type β has been defined and its relationship with a result of generalized Havrda and Charvat and Tsallis’s entropy has been discussed. Using Lα, some coding theorem for discrete noiseless channel has been proved.
متن کاملQuantum Coding Theorems for Arbitrary Sources, Channels and Entanglement Resources
The information spectrum approach gives general formulae for optimal rates of various information theoretic protocols, under minimal assumptions on the nature of the sources, channels and entanglement resources involved. This paper culminates in the derivation of the dense coding capacity for a noiseless quantum channel, assisted by arbitrary shared entanglement, using this approach. We also re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 1997